Application of higher order spectral features and support vector machines for bearing faults classification

Condition monitoring and fault diagnosis of rolling element bearings timely and accurately are very important to ensure the reliability of rotating machinery. This paper presents a novel pattern classification approach for bearings diagnostics, which combines the higher order spectra analysis features and support vector machine classifier. The use of non-linear features motivated by the higher order spectra has been reported to be a promising approach to analyze the non-linear and non-Gaussian characteristics of the mechanical vibration signals. The vibration bi-spectrum (third order spectrum) patterns are extracted as the feature vectors presenting different bearing faults. The extracted bi-spectrum features are subjected to principal component analysis for dimensionality reduction. These principal components were fed to support vector machine to distinguish four kinds of bearing faults covering different levels of severity for each fault type, which were measured in the experimental test bench running under different working conditions. In order to find the optimal parameters for the multi-class support vector machine model, a grid-search method in combination with 10-fold cross-validation has been used. Based on the correct classification of bearing patterns in the test set, in each fold the performance measures are computed. The average of these performance measures is computed to report the overall performance of the support vector machine classifier. In addition, in fault detection problems, the performance of a detection algorithm usually depends on the trade-off between robustness and sensitivity. The sensitivity and robustness of the proposed method are explored by running a series of experiments. A receiver operating characteristic (ROC) curve made the results more convincing. The results indicated that the proposed method can reliably identify different fault patterns of rolling element bearings based on vibration signals.     

改进HSR-FCN的服装图像识别分类算法研究

目前网络上的服装图像数量增长迅猛，对于大量服装图像实现智能分类的需求日益增加。将基于区域的全卷积网络（Region-Based Fully Convolutional Networks，R-FCN）引入到服装图像识别中，针对服装图像分类中网络训练时间长、形变服装图像识别率低的问题，提出一种新颖的改进框架HSR-FCN。新框架将R-FCN中的区域建议网络和HyperNet网络相融合，改变图片特征学习方式，使得HSR-FCN可以在更短的训练时间内达到更高的准确率。在模型中引入了空间转换网络，对输入服装图像和特征图进行了空间变换及对齐，加强了对多角度服装和形变服装的特征学习。实验结果表明，改进后的HSR-FCN模型有效地加强了对形变服装图像的学习，且在训练时间更短的情况下，比原来的网络模型R-FCN平均准确率提高了大约3个百分点，达到96.69%。     

A novel intelligent approach for yaw position forecasting in wind energy systems

Yaw control systems orientate the rotor of a wind turbine into the wind direction, optimize the wind power generated by wind turbines and alleviate the mechanical stresses on a wind turbine. Regarding the advantages of yaw control systems, a k-nearest neighbor classifier (k-NN) has been developed in order to forecast the yaw position parameter at 10-min intervals in this study. Air temperature, atmosphere pressure, wind direction, wind speed, rotor speed and wind power parameters are used in 2, 3, 4, 5 and 6-dimensional input spaces. The forecasting model using Manhattan distance metric for k = 3 uncovered the most accurate performance for atmosphere pressure, wind direction, wind speed and rotor speed inputs. However, the forecasting model using Euclidean distance metric for k = 1 brought out the most inconsistent results for atmosphere pressure and wind speed inputs. As a result of multi-tupled analyses, many feasible inferences were achieved for yaw position control systems. In addition, the yaw position forecasting model developed was compared with the persistence model and it surpassed the persistence model significantly in terms of the improvement percent.     

基于桥连接的词典学习方法的语义解析

现阶段的语义解析方法大部分都基于组合语义,这类方法的核心就是词典。词典是词汇的集合,词汇定义了自然语言句子中词语到知识库本体中谓词的映射。语义解析一直面临着词典中词汇覆盖度不够的问题。针对此问题,该文在现有工作的基础上,提出了基于桥连接的词典学习方法,该方法能够在训练中自动引入新的词汇并加以学习,为了进一步提高新学习到的词汇的准确度,该文设计了新的词语—二元谓词的特征模板,并使用基于投票机制的核心词典获取方法。该文在两个公开数据集(WebQuestions和Free917)上进行了对比实验,实验结果表明,该文方法能够学习到新的词汇,提高词汇的覆盖度,进而提升语义解析系统的性能,特别是召回率。     

Epos – an instrument for the assessment of the ethical position in software development

Digital technology becomes more powerful, intelligent, pervasive and ubiquitous. Ethical aspects of this development have not yet drawn the appropriate attention of researchers and engineers. This paper presents an instrument that aims at measuring the individual ethical position with regard to the design and development of computer software. The development of the Epos tool was based on two data collections. The data of the first survey (n₁ = 147 participants) were used to select items and to determine the factorial structure of the questionnaire. Results show that the Epos instrument reliably assesses peoples’ ethical opinion with respect to five central components: (1) regulation, (2) data privacy, (3) domain specific knowledge, (4) societal responsibility and (5) company responsibility. In the second survey, we determined the stability of the instruments factor structure by assessing a sample of n₂?=?196 participants. A confirmatory factor analysis (CFA) supported the initial factor structure. Next steps and further implications are discussed regarding the final version of the questionnaire.     

Nonuniform linear array DOA estimation using EM criterion

In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources.     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

Multiple Empirical Kernel Learning with Majority Projection for imbalanced problems

Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound.